The subword complexity of atwo - parameter family of sequencesAviezri
نویسندگان
چکیده
We determine the subword complexity of the characteristic functions of a two-parameter family fA n g 1 n=1 of innnite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form A n = bnnc for all n 2 Z >0 , where is a xed positive irrational number. The characteristic functions of such sequences have been shown to have subword complexity n + 1. We show that every sequence in the extended family has subword complexity O(n).
منابع مشابه
The complexity of a two - parameter familyof sequencesAviezri
We determine the complexity of the characteristic functions of a two-parameter family fA n g 1 n=1 of innnite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form A n = bnnc for all n 2 Z + , where is a xed positive irrational number. The characteristic functions of such sequences have been shown to have complexity ...
متن کاملThe Subword Complexity of a Two-Parameter Family of Sequences
We determine the subword complexity of the characteristic functions of a twoparameter family {An}∞n=1 of infinite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form An = bnαc for all n ∈ Z>0, where α is a fixed positive irrational number. The characteristic functions of such sequences have been shown to have subwo...
متن کاملSome properties of a class of polyhedral semigroups based upon the subword reversing method
In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined. The completeness of the presentation and solvability of word problem of this class of semigroups is determined. Moreover the combinatorial distance between two words is determined.
متن کاملSubword complexity and power avoidance
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that – the Thue-Morse word has the minimum possible subword complexity over all overlapfree binary words and all (73)-power-free binary words, but not over all ( 7 3) +-power-free binary words; – the twisted Thue-Morse word has the maximum possible sub...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کامل